A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours
نویسندگان
چکیده
منابع مشابه
A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملA Hybrid Algorithm for a Two-Echelon Location- Routing Problem with Simultaneous Pickup and Delivery under Fuzzy Demand
Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...
متن کاملthe innovation of a statistical model to estimate dependable rainfall (dr) and develop it for determination and classification of drought and wet years of iran
آب حاصل از بارش منبع تأمین نیازهای بی شمار جانداران به ویژه انسان است و هرگونه کاهش در کم و کیف آن مستقیماً حیات موجودات زنده را تحت تأثیر منفی قرار می دهد. نوسان سال به سال بارش از ویژگی های اساسی و بسیار مهم بارش های سالانه ایران محسوب می شود که آثار زیان بار آن در تمام عرصه های اقتصادی، اجتماعی و حتی سیاسی- امنیتی به نحوی منعکس می شود. چون میزان آب ناشی از بارش یکی از مولفه های اصلی برنامه ...
15 صفحه اولModelling and Solving the Capacitated Location-Routing Problem with Simultaneous Pickup and Delivery Demands
In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...
متن کاملA Memetic Algorithm for the Vehicle Routing Problem with Cross Docking
In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2019
ISSN: 0360-8352
DOI: 10.1016/j.cie.2019.05.038